Planar Crossing Numbers of Graphs Embeddable in Another Surface
نویسندگان
چکیده
Let G be a graph of n vertices with maximum degree d that can be drawn without crossing in a closed surface of Euler characteristic χ. It is proved that then G can be drawn in the plane with at most cχdn crossings, where cχ is a constant depending only on χ. This result, which is tight up to a constant factor, is strengthened and generalized to the case when there is no restriction on the degrees of the vertices.
منابع مشابه
Shortest Path Embeddings of Graphs on Surfaces
The classical theorem of Fáry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment. We consider generalizations of Fáry’s theorem to surfaces equipped with Riemannian metrics. In this setting, we require that every edge is drawn as a shortest path between its two endpoints and we call an embedding with this property a sh...
متن کاملRandom graphs on surfaces
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, ...
متن کاملClin d’oeil on Lj-embeddable planar graphs
In this note we present some properties of LI-embeddable planar graphs. We present a characterization of graphs isometrically embeddable into half-cubes. This result implies that every planar Li-graph G has a scale 2 embedding into a hypercube. Further, under some additional conditions we show that for a simple circuit C of a planar Li-graph G the subgraph H of G bounded by C is also Li-embedda...
متن کاملThe crossing numbers of join products of paths with graphs of order four
Kulli and Muddebihal [V.R. Kulli, M.H. Muddebihal, Characterization of join graphs with crossing number zero, Far East J. Appl. Math. 5 (2001) 87–97] gave the characterization of all pairs of graphs which join product is planar graph. The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. There are only few results concerning crossing numb...
متن کاملCounting planar graphs and related families of graphs
In this article we survey recent results on the asymptotic enumeration of planar graphs and, more generally, graphs embeddable in a fixed surface and graphs defined in terms of excluded minors. We also discuss in detail properties of random planar graphs, such as the number of edges, the degree distribution or the size of the largest k-connected component. Most of the results we present use gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 17 شماره
صفحات -
تاریخ انتشار 2006